Solvability of Graph Inequalities
نویسندگان
چکیده
We investigate a new type of graph inequality (in the tradition of Cvetković, Simić, and Capobianco) which is based on the subgraph relation and which allows as terms fixed graphs, graph variables with specified vertices, and the operation of identifying vertices. We present a simple graph inequality which does not have a solution, and show that the solvability of inequalities with only one graph variable and one specified vertex can be decided (in nondeterministic exponential time). The solvability of graph inequalities over directed graphs, however, turns out to be undecidable. 1 A Simple Graph Inequality Consider this diagram:
منابع مشابه
On the graph isomorphism problem
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is related to the complexity of the graphs isomorphism and subgraph isomorphim problems. 2000 Mathematics Subject Classification: 03D15, 05C50, 05C60, 15A48, 15A51, 15A69, 90C05.
متن کاملGraph Entropy, Network Coding and Guessing games
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is identical to its guessing number and can be bounded from below with the number of vertices minus the size of the graph’s shortest index code. We show that the Network Coding solvability of each specific multiple unicast n...
متن کاملSolvability of Parametric Interval Linear Systems of Equations and Inequalities
Considered are linear algebraic systems of equations and/or inequalities involving linear dependencies between interval-valued parameters. The goal is to characterize weak and strong solvability of such systems. Since any parametric interval equation is equivalent to a system of parametric interval inequalities, the focus is on the latter. We discuss an algorithmic procedure for characterizing ...
متن کاملSOLVABILITY OF FREE PRODUCTS, CAYLEY GRAPHS AND COMPLEXES
In this paper, we verify the solvability of free product of finite cyclic groups with topological methods. We use Cayley graphs and Everitt methods to construct suitable 2-complexes corresponding to the presentations of groups and their commutator subgroups. In particular, using these methods, we prove that the commutator subgroup of $mathbb{Z}_{m}*mathbb{Z}_{n}$ is free of rank $(m-1)(n-1)$ fo...
متن کاملSome topological indices of graphs and some inequalities
Let G be a graph. In this paper, we study the eccentric connectivity index, the new version of the second Zagreb index and the forth geometric–arithmetic index.. The basic properties of these novel graph descriptors and some inequalities for them are established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 19 شماره
صفحات -
تاریخ انتشار 2005